Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the Feferman-Vaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order logic with modular counting quantifiers. For sum-like operations it is CMSOL, the corresponding monadic second order logic. We discuss whether there are maximal logics satisfying Feferman-Vaught Theorems for finite structures.Comment: Appeared in YuriFest 2015, held in honor of Yuri Gurevich's 75th birthday. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23534-9_1

Maximizing Happiness in Graphs of Bounded Clique-Width

Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter. In this paper we study how clique-width influences the complexity of the Maximum Happy Vertices (MHV) and Maximum Happy Edges (MHE) problems. We answer a question of Choudhari and Reddy '18 about parameterization by the distance to threshold graphs by showing that MHE is NP-complete on threshold graphs. Hence, it is not even in XP when parameterized by clique-width, since threshold graphs have clique-width at most two. As a complement for this result we provide a $n^{\mathcal{O}(\ell \cdot \operatorname{cw})}$ algorithm for MHE, where $\ell$ is the number of colors and $\operatorname{cw}$ is the clique-width of the input graph. We also construct an FPT algorithm for MHV with running time $\mathcal{O}^*((\ell+1)^{\mathcal{O}(\operatorname{cw})})$, where $\ell$ is the number of colors in the input. Additionally, we show $\mathcal{O}(\ell n^2)$ algorithm for MHV on interval graphs.Comment: Accepted to LATIN 202

Bounding clique-width via perfect graphs

We continue the study into the clique-width of graph classes defined by two forbidden induced graphs. We present three new classes of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their two forbidden induced subgraphs is the diamond. To prove boundedness of clique-width for the first three cases we develop a technique based on bounding clique covering number in combination with reduction to subclasses of perfect graphs. We extend our proof of unboundedness for the fourth case to show that Graph Isomorphism is Graph Isomorphism-complete on the same graph class

Resolution of disseminated fusariosis in a child with acute leukemia treated with combined antifungal therapy: a case report

<p>Abstract</p> <p>Background</p> <p><it>Fusarium </it>spp. is being isolated with increasing frequency as a pathogen in oncohematologic patients. Caspofungin and amphotericin B have been reported to have synergistic activity against <it>Fusarium </it>spp.</p> <p>Case presentation</p> <p>We herein report a case of disseminated fusariosis diagnosed by chest CT scan and positive blood cultures to <it>Fusarium </it>spp. Because the patient's clinical condition deteriorated, CRP levels increased, and blood cultures continued to yield <it>Fusarium </it>spp. despite liposomal amphotericin B monotherapy up to 5 mg/kg daily, treatment with caspofungin was added. Within 2 weeks of onset of combined antifungal therapy, the chest CT scan demonstrated a progressive resolution of the pulmonary lesions. Upon discontinuation of intravenous antifungals, the patient received suppressive therapy with oral voriconazole. Three months later, a chest CT scan showed no abnormalities. Twenty-five months after discontinuation of all antifungal therapy, the patient remains in complete remission of her neoplastic disease with no signs of clinical activity of the <it>Fusarium </it>infection.</p> <p>Conclusion</p> <p>This is the first description of successful treatment of disseminated fusariosis in a pediatric patient with acute lymphoblastic leukemia with caspofungin and amphotericin B followed by oral suppressive therapy with voriconazole.</p

Delegation and coordination with multiple threshold public goods: experimental evidence

When multiple charities, social programs and community projects simultaneously vie for funding, donors risk mis-coordinating their contributions leading to an inefficient distribution of funding across projects. Community chests and other intermediary organizations facilitate coordination among donors and reduce such risks. To study this, we extend a threshold public goods framework to allow donors to contribute through an intermediary rather than directly to the public goods. Through a series of experiments, we show that the presence of an intermediary increases public good success and subjects’ earnings only when the intermediary is formally committed to direct donations to socially beneficial goods. Without such a restriction, the presence of an intermediary has a negative impact, complicating the donation environment, decreasing contributions and public good success.When multiple charities, social programs and community projects simultaneously vie for funding, donors risk mis-coordinating their contributions leading to an inefficient distribution of funding across projects. Community chests and other intermediary organizations facilitate coordination among donors and reduce such risks. To study this, we extend a threshold public goods framework to allow donors to contribute through an intermediary rather than directly to the public goods. Through a series of experiments, we show that the presence of an intermediary increases public good success and subjects’ earnings only when the intermediary is formally committed to direct donations to socially beneficial goods. Without such a restriction, the presence of an intermediary has a negative impact, complicating the donation environment, decreasing contributions and public good success

Clique-width : harnessing the power of atoms.

Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class G if they are so on the atoms (graphs with no clique cut-set) of G . Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph G is H-free if H is not an induced subgraph of G, and it is (H1,H2) -free if it is both H1 -free and H2 -free. A class of H-free graphs has bounded clique-width if and only if its atoms have this property. This is no longer true for (H1,H2) -free graphs, as evidenced by one known example. We prove the existence of another such pair (H1,H2) and classify the boundedness of clique-width on (H1,H2) -free atoms for all but 18 cases

Extremely Low Genetic Diversity Indicating the Endangered Status of Ranodon sibiricus (Amphibia: Caudata) and Implications for Phylogeography

Background: The Siberian salamander (Ranodon sibiricus), distributed in geographically isolated areas of Central Asia, is an ideal alpine species for studies of conservation and phylogeography. However, there are few data regarding the genetic diversity in R. sibiricus populations. Methodology/Principal Findings: We used two genetic markers (mtDNA and microsatellites) to survey all six populations of R. sibiricus in China. Both of the markers revealed extreme genetic uniformity among these populations. There were only three haplotypes in the mtDNA, and the overall nucleotide diversity in the mtDNA was 0.00064, ranging from 0.00000 to 0.00091 for the six populations. Although we recovered 70 sequences containing microsatellite repeats, there were only two loci that displayed polymorphism. We used the approximate Bayesian computation (ABC) method to study the demographic history of the populations. This analysis suggested that the extant populations diverged from the ancestral population approximately 120 years ago and that the historical population size was much larger than the present population size; i.e., R. sibiricus has experienced dramatic population declines. Conclusion/Significance: Our findings suggest that the genetic diversity in the R. sibiricus populations is the lowest among all investigated amphibians. We conclude that the isolation of R. sibiricus populations occurred recently and was a result of recent human activity and/or climatic changes. The Pleistocene glaciation oscillations may have facilitated intraspecie

On counting generalized colorings

It is well known that the number of proper k-colorings of a graph is a polynomial in k. We investigate in this talk under what conditions a numeric graph invariant which is parametrized with parameters k 1, ..., k m is a polynomial in these parameters. We give a sufficient conditions for this to happen which is general enough to encompass all the graph polynomials which are definable in Second Order Logic. This not only covers the various generalizations of the Tutte polynomials, Interlace polynomials, Matching polynomials, but allows us to identify new graph polynomials related to combinatorial problems discussed in the literature. © 2008 Springer-Verlag Berlin Heidelberg